翻訳と辞書
Words near each other
・ Search and Rescue Training Unit
・ Search and rescue transponder
・ Search and Rescue Wing RAAF
・ Search and seizure
・ Search and seizure law in Pennsylvania
・ Search and Surveillance Act 2012 and human rights
・ Search appliance
・ Search as a service
・ Search Bloc
・ Search box
・ Search Bureau for Missing Relatives
・ Search by sound
・ Search coil
・ Search Committee
・ Search cost
Search data structure
・ Search domain
・ Search EDP Inc.
・ Search engine (computing)
・ Search engine (disambiguation)
・ Search Engine (radio show)
・ Search engine indexing
・ Search engine manipulation effect
・ Search engine marketing
・ Search Engine Marketing in China
・ Search engine optimization
・ Search engine optimization metrics
・ Search engine results page
・ Search Engine Roundtable
・ Search Engine Strategies


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Search data structure : ウィキペディア英語版
Search data structure

In computer science, a search data structure is any data structure that allows the efficient retrieval of specific items from a set of items, such as a specific record from a database.
The simplest, most general, and least efficient search structure is merely an unordered sequential list of all the items. Locating the desired item in such a list, by the linear search method, inevitably requires a number of operations proportional to the number ''n'' of items, in the worst case as well as in the average case. Useful search data structures allow faster retrieval; however, they are limited to queries of some specific kind. Moreover, since the cost of building such structures is at least proportional to ''n'', they only pay off if several queries are to be performed on the same database (or on a database that changes little between queries).
Static search structures are designed for answering many queries on a fixed database; dynamic structures also allow insertion, deletion, or modification of items between successive queries. In the dynamic case, one must also consider the cost of fixing the search structure to account for the changes in the database.
==Classification==

The simplest kind of query is to locate a record that has a specific field (the ''key'') equal to a specified value ''v''. Other common kinds of query are "find the item with smallest (or largest) key value", "find the item with largest key value not exceeding ''v''", "find all items with key values between specified bounds ''v''min and ''v''max".
In certain databases the key values may be points in some multi-dimensional space. For example, the key may be a geographic position (latitude and longitude) on the Earth. In that case, common kinds of queries are ''find the record with a key closest to a given point ''v''", or "find all items whose key lies at a given distance from ''v''", or "find all items within a specified region ''R'' of the space".
A common special case of the latter are simultaneous range queries on two or more simple keys, such as "find all employee records with salary between 50,000 and 100,000 and hired between 1995 and 2007".

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Search data structure」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.